Marching Correctors – Fast and Precise Polygonal Isosurfaces of SPH Data
نویسندگان
چکیده
This paper presents the first method for isosurface extraction from smoothed particle hydrodynamics (SPH) data that is exact with respect to the functional representation provided by SPH. The Marching Correctors algorithm is an extension of the Marching Cubes algorithm which is adapted to the SPH representation and avoids resampling to a full grid. The algorithm operates on a virtual grid of sufficiently high resolution to faithfully reconstruct the fields represented by the SPH data. The virtual grid is efficient in terms of both memory usage and computing time, because cells are only materialized and processed if they are either seed cells or intersected by the isosurface. Besides the virtual grid, a key idea of our algorithm is to add a correction step to the isosurface vertices. An evaluation of the algorithm in terms of accuracy and performance is given based on three SPH datasets. By comparing with [1] on similarly sized data a performance gain of almost two orders of magnitude was achieved. Moreover, it is demonstrated how the correction step effectively reduces the typical artifacts produced by the Marching Cubes method.
منابع مشابه
Parallel Multipipe Rendering for Very Large Isosurface Visualization
In exploratory scientiic visualization, isosurfaces are typically created with an explicit polygonal representation for the surface using a technique such as Marching Cubes. For even moderate data sets, Marching Cubes can generate an extraordinary number of polygons , which take time to construct and to render. To address the rendering bottleneck, we have developed a multipipe strategy for para...
متن کامل"Skeleton climbing": fast isosurfaces with fewer triangles
Skeleton Climbing is an algorithm that builds triangulated isosurfaces in 3D grid data, more economically than Marching Cubes, and without the time penalty of current mesh decimation algorithms. Building the surface from its intersections with grid edges (1-skeleton), then faces (2-skeleton), then cubes (3-skeleton), treats the data in a uniform way; this allows a 25% reduction in the number of...
متن کاملImproved marching cubes using novel adjacent lookup table and random sampling for medical object-specific 3D visualization
The marching cubes (MC) algorithm is a widely used routine to extract isosurfaces from volumetric data set. This method suffers from the exhaustive accessing cubes sequentially and the failure of directly separating the isosurfaces. To address this, an improved MC algorithm called AlutMC is proposed to track connected surfaces by combining a new adjacent lookup table and random sampling techniq...
متن کاملTopology Correction Using Fast Marching Methods and Its Application to Brain Segmentation
We present here a new method for correcting the topology of objects segmented from medical images. Whereas previous techniques alter a surface obtained from the hard segmentation of the object, our technique works directly in the image domain, propagating the topology for all isosurfaces of the object. From an analysis of topological changes and critical points in implicit surfaces, we introduc...
متن کاملVolume-Enclosing Surface Extraction
In this paper we present a new method, which allows for the construction of triangular isosurfaces from three-dimensional data sets, such as 3D image data and/or numerical simulation data that are based on regularly shaped, cubic lattices. This novel volume-enclosing surface extraction technique, which has been named VESTA, can produce up to six different results due to the nature of the discre...
متن کامل